Deriving Partial Correctness Logics From Evolving Algebras
نویسنده
چکیده
This extended abstract gives an introduction into the development of partial correctness logics for programming languages speci ed by evolving algebras. A partial correctness logic is a programming logic that allows to prove program properties of the form: \whenever program point P is reached during execution, assertion A is true". We derive a basic axiom (schema) from an evolving algebra and use this axiom to obtain more convenient logics. This work aims to develop the foundations for programming environments that support formal reasoning about programs. One of the major problems with this challenge is the systematic design of programming logics for realistic programming languages. Experiences e.g. with Hoare logic have shown that it can be di cult to design consistent programming logics even for simple languages from scratch (cf. [O'D81]). Using evolving algebras as semantical basis has two advantages:
منابع مشابه
Partial Semigroups and Convolution Algebras
Partial Semigroups are relevant to the foundations of quantum mechanics and combinatorics as well as to interval and separation logics. Convolution algebras can be understood either as algebras of generalised binary modalities over ternary Kripke frames, in particular over partial semigroups, or as algebras of quantale-valued functions which are equipped with a convolution-style operation of mu...
متن کاملA Compiler Correctness Proof for the Static Link Technique by Means of Evolving Algebras
The well-known static link technique is used for stack-based implementations of imperative programming languages which admit nested recursive procedure declarations. Its basic idea is to access non{local variables by tracing a static link chain to lower stack elements. Evolving algebras are a new method for deening operational semantics of abstract machines. Based on an appropriate stack machin...
متن کاملEvolving Algebras: an Attempt to Discover Semantics
This tutorial is based on lecture notes from the Fall 1990 course on Principles of Programming Languages at the University of Michigan. (My young friend Quisani did not attend the lectures.) The present version incorporates some changes provoked by the necessity to update the bibliography. The main part of the paper is still the same, however, and the examples are unchanged even though many thi...
متن کاملEvolving Algebras and Partial Evaluation
We describe an automated partial evaluator for evolving algebras implemented at the University of Michigan.
متن کاملFoundations of Modal Deductive Databases ∗ Linh
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the top-down evaluation algorithm, and the magic-set transformation for MDatalog queries. The results of this paper like soundness and completeness of the top-down evaluation algorithm or correctness of the magic-...
متن کامل